Non-deterministic inductive definitions
نویسنده
چکیده
We study a new proof principle in the context of constructive ZermeloFraenkel set theory based on what we will call “non-deterministic inductive definitions”. We give applications to formal topology as well as a predicative justification of this principle.
منابع مشابه
Abstract Interpretation of Non-monotone Bi-inductive Semantic Definitions
Interpretation of Non-monotone Bi-inductive Semantic Definitions ,
متن کاملOn Automated Lemma Generation for Separation Logic with Inductive Definitions
Separation Logic with inductive definitions is a well-known approach for deductive verification of programs that manipulate dynamic data structures. Deciding verification conditions in this context is usually based on user-provided lemmas relating the inductive definitions. We propose a novel approach for generating these lemmas automatically which is based on simple syntactic criteria and dete...
متن کاملInductive Situation Calculus
Temporal reasoning has always been a major test case for knowledge representation formalisms. In this paper, we develop an inductive variant of the situation calculus in ID-logic, classical logic extended with Inductive Definitions. This logic has been proposed recently and is an extension of classical logic. It allows for a uniform representation of various forms of definitions, including mono...
متن کاملBi-inductive structural semantics
We propose a simple order-theoretic generalization, possibly non monotone, of settheoretic inductive definitions. This generalization covers inductive, co-inductive and bi-inductive definitions and is preserved by abstraction. This allows structural operational semantics to describe simultaneously the finite/terminating and infinite/diverging behaviors of programs. This is illustrated on gramma...
متن کاملDeciding Entailments in Inductive Separation Logic with Tree Automata
Separation Logic (SL) with inductive definitions is a natural formalism for specifying complex recursive data structures, used in compositional verification of programs manipulating such structures. The key ingredient of any automated verification procedure based on SL is the decidability of the entailment problem. In this work, we reduce the entailment problem for a non-trivial subset of SL de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Arch. Math. Log.
دوره 52 شماره
صفحات -
تاریخ انتشار 2013